package com.leo.algorithm.tree;

// 基本的 N 叉树节点
public class NTreeNode {
    int val;
    NTreeNode[] children;

    public NTreeNode(int val) {
        this.val = val;
    }
}
